On Relative Content and Green's Lemma*
نویسنده
چکیده
in which P(xy) =x; and it is to be noted that here C does not need to be rectifiable. In the present paper a definition of relative content is given which makes it possible to prove that if P and Px are subject to certain conditions, the content of K, relative to a certain non-additive function of rectangles derived from P, exists equal to the double integral on the left of (1) and also equal to the line integral on the right of (1) whenever that integral exists. This result includes as a special case the form of Green's lemma for rectifiable C obtained by Gross,t except that in our result Px is deliberately restricted to be properly Riemann integrable instead of summable. In the last section sufficient conditions for the existence of the line integral are given which yield Green's lemma for an important case in which C does not need to be rectifiable. 1. Definitions and elementary theorems. Let *ß denote a class of partitions El of the rectangle R0: a^x^b, c^y^d, such that (1) each partition JJ is formed by dividing R0 into vertical and horizontal strips; and (2) the (greatest) lower bound of the norms of the partitions II of ^? is zero ; here by the norm of a partition n of $ is meant the (least) upper bound of the lengths of the diagonals of the rectangles of which n consists. Moreover let f(R) be a function (not necessarily single-valued) defined for every rectangle R: x'_*_*", y'úyúy" lying in R0. Also, if K\ and K2 are any two sets in R0, let t(Ku K2) = 1 if Ki and K2 have at least one point
منابع مشابه
Erratum to a New Inequality for the Green's Function
The paper [l] gave a short elementary derivation of the best-possible value of Koebe's constant, a derivation using geometric methods free of the arithmetic reasoning characteristic of "hard analysis." Professor Albert Pfluger has informed me that the inequality in my Lemma 3.1 must be reversed. This note contains a revised version of that lemma and of the proof of Theorem 3.2, which proof depe...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملMorpho-phenology and chromosome number of Iranian Bromus danthoniae Trin. genotypes
ABSTRACT- Bromus danthoniae Trin. is an annual grass species which grows mainly on dry grassy rocky mountain slopes and grassy steppe, and is grazed by many herbivores and recognized as a useful pasture plant. The chromosome number, morphological and anatomical traits of 82 genotypes of B. danthoniae belonging to three sub-taxa were investigated. Twenty-seven quantitative and 20 qualitative mor...
متن کاملApplication of Hopf's lemma on contact CR-warped product submanifolds of a nearly Kenmotsu manifold
In this paper we consider contact CR-warped product submanifolds of the type $M = N_Ttimes_f N_perp$, of a nearly Kenmotsu generalized Sasakian space form $bar M(f_1, f_2, f_3)$ and by use of Hopf's Lemma we show that $M$ is simply contact CR-product under certain condition. Finally, we establish a sharp inequality for squared norm of the second fundamental form and equality case is dis...
متن کاملA tight bound for Green's arithmetic triangle removal lemma in vector spaces
Let p be a fixed prime. A triangle in Fp is an ordered triple (x, y, z) of points satisfying x + y + z = 0. Let N = p, (the size of Fp ). Green proved an arithmetic triangle removal lemma which says that for every > 0 and prime p, there is a δ > 0 such that if X, Y , and Z are subsets of Fp and the number of triangles in X × Y ×Z is at most δN (so a δ fraction of all possible triangles), then w...
متن کامل